A Proof Obligation Generator for VDM-SL
نویسندگان
چکیده
In this paper an extension of the IFAD VDM-SL Toolbox with a proof obligation generator is described. Static type checking in VDM is undecidable in general and therefore the type checker must be incomplete. Hence, for the “difficult” parts introducing undecidability, it is up to the user to verify the consistency of a specification. Instead of providing error messages and warnings, the approach of generating proof obligations for the consistency of VDM-SL specifications is taken. The overall goal of this work is to automate the generation of proof obligations for VDM-SL. Proof obligation generation has already been carried out for a number of related notations, but VDM-SL contains a number of challenging constructs (e.g. patterns, non-disjoint union types, and operations) for which new research is presented in this paper.
منابع مشابه
A Proof Obligation Generator for VDM - SLBernhard
proof obligations errors, warnings proof obligations parser errors, warnings syntax tree type checker proof tool GUI Fig. 1. Interaction of the new type checker. The main advantage of this approach is the combination of a type checker and a proof tool. In the cases where the type checker is not able to check the consistency, the proof theory in the proof tool can be applied to prove the consist...
متن کاملTowards Proof Rules for Looseness in Explicit Definitions from VDM-SL
The model-oriented formal method called VDM contains a speciication language called VDM-SL. This language existed in a number of diierent dialects, but now a standard for the language has been prepared, including a dynamic semantics deened from a model-theoretic point of view. Thus, it is not at all clear that the deened semantics is appropriate for deriving proof rules which reeect the semanti...
متن کاملTowards Proof Rules for Looseness in Explicit De nitions from VDM SL
The model oriented formal method called VDM contains a speci cation language called VDM SL This language existed in a number of di erent dialects but now a standard for the language has been prepared includ ing a dynamic semantics de ned from a model theoretic point of view Thus it is not at all clear that the de ned semantics is appropriate for deriving proof rules which re ect the semantics T...
متن کاملWhat Top-Level Software Engineers Tackle after Learning Formal Methods: Experiences from the Top SE Project
VDM++ Model Refined VDM++ Model Refinement (e.g., component partition) Annotation syntax for “Link Invariants” (i.e., relationship between variables in abstract/refined models) Proof-of-Concept tool by translation to Event-B (only target non-procedural syntax of VDM++) Link Invariants Abstract Event-B Model Refined Event-B Model Proof-obligation generation and automated proof by RODINEvent-B Mo...
متن کاملOn the Verification of VDM Specification and Refinement with PVS
Although the formal method VDM has been in existence since the 1970’s, there are still no satisfactory tools to support verification in VDM. This paper deals with one possible means of approaching this problem by using the PVS theorem-prover. It describes a translation of a VDM-SL specification into the PVS specification language using, essentially, the very transparent translation methods desc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997